Characterization of Petri Net Languages
نویسنده
چکیده
This work treats the relationship between Petri Nets and languages. In 2003, Darondeau solved the Petri Net synthesis problem for a certain class of languages, i. e. for a given language L of this class he constructed a Petri Net generating the least Petri Net language containing L. Furthermore, he developed a decision procedure which tests for equality of these two languages. It is proved here that all Petri Net languages are in the class of languages introduced by Darondeau. Namely, these are the prefix-closed languages which have a semi-linear commutative (also called Parikh) image. Hence, a characterization of Petri Net languages is given.
منابع مشابه
Logical Characterization of Petri Net !-languages
In this paper, we study some classes of Petri net deenable !-languages. We consider several types of accepting conditions on Petri nets, corresponding to those considered on nite automata in the theory of !-regular languages. Then, we establish a neat correspondence between the classes of Petri net deenable !-languages and the classes of nite automata deenable !-languages. Moreover, each class ...
متن کاملAlgebraic Characterization of Petri Net PomsetSemanticsHarro
Sets of pomsets are frequently used as a true-concurrency, linear-time semantics of Petri nets. For a Petri net N, let P(N), a set of pomsets, denote this pomset behaviour of N, and let P := fP(N) j N is a Petri netg denote the class of pomset behaviours of Petri nets, a generalization of L, the class of all Petri net languages. We present here an algebraic characterization for P, similar to th...
متن کاملCancellation in context-free languages: enrichment by reduction
Jantzen, M., H. Petersen, Cancellation in context-free languages: enrichment by reduction, Theoretical Computer Science 127 (1994) 1499170. The following problem is shown to be decidable: Given a context-free grammar G and a string weX*, does there exist a string ueL(G) such that w is obtained from u by deleting all substrings ui that are elements of the symmetric Dyck set DT? The intersection ...
متن کاملJumping Petri Nets. Specific Properties Jumping Petri Nets. Speciic Properties
A Jumping Petri Net ((18], 12]), JP T N for short, is deened as a classical net which can spontaneously jump from a marking to another one. In 18] it has been shown that the reachability problem for JP T N 's is undecidable, but it is decidable for nite JP T N 's (FJPTN). In this paper we establish some speciic properties and investigate the computational power of such nets, via the interleavin...
متن کاملCancellation on Context-Free Languages: Enrichment by Reduction
The following problem is shown to be decidable: Given a context-free grammar G and a string w 2 X , does there exist a string u 2 L(G) such that w is obtained from u by deleting all substrings u i that are elements of the symmetric Dyck set D 1 ? The intersection of any two context-free languages can be obtained from only one context-free language by cancellation either with the smaller semi-Dy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011